A graph and its complement with specified properties V: The self‐complement index
نویسندگان
چکیده
منابع مشابه
Degree distance index of the Mycielskian and its complement
In this paper, we determine the degree distance of the complement of arbitrary Mycielskian graphs. It is well known that almost all graphs have diameter two. We determine this graphical invariant for the Mycielskian of graphs with diameter two.
متن کاملgraphs cospectral with a friendship graph or its complement
let $n$ be any positive integer and let $f_n$ be the friendship (or dutch windmill) graph with $2n+1$ vertices and $3n$ edges. here we study graphs with the same adjacency spectrum as the $f_n$. two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. let $g$ be a graph cospectral with $f_n$. here we prove that if $g$ has no cycle of length $4$ or $...
متن کاملthe past hospitalization and its association with suicide attempts and ideation in patients with mdd and comparison with bmd (depressed type) group
چکیده ندارد.
Some properties and domination number of the complement of a new graph associated to a commutative ring
In this paper some properties of the complement of a new graph associated with a commutative ring are investigated ....
متن کاملOn the Connectivity of a Graph and its Complement Graph
In this paper, we study the connectivity of the complement of a graph. We first establish a simple formula to compute the connectivity of a graph that comes from the join of graphs. Base on this formula, we give an upper and a lower bound to the connectivity of the complement of a graph. Keyword: connectivity, complement, join, vertex of attachment.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematika
سال: 1980
ISSN: 0025-5793,2041-7942
DOI: 10.1112/s0025579300009943